Permutation Models for Relational Data∗

نویسنده

  • Carter T. Butts
چکیده

We here propose an exponential family of permutation models that is suitable for inferring the direction and strength of association among dyadic relational structures. A linear-time algorithm is shown for MCMC simulation of model draws, as is the use of simulated draws for maximum likelihood estimation (MCMC-MLE) and/or estimation of Monte Carlo standard errors. We also provide an easily performed maximum pseudo-likelihood estimation procedure for the permutation model family, which provides a reasonable means of generating seed models for the MCMC-MLE procedure. Use of the modeling framework is demonstrated via an application involving relationships among managers in a high-tech firm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metadata Enrichment for Automatic Data Entry Based on Relational Data Models

The idea of automatic generation of data entry forms based on data relational models is a common and known idea that has been discussed day by day more than before according to the popularity of agile methods in software development accompanying development of programming tools. One of the requirements of the automation methods, whether in commercial products or the relevant research projects, ...

متن کامل

Determination of Financial Failure Indicators by Gray Relational Analysis and Application of Data Envelopment Analysis and Logistic Regression Analysis in BIST 100 Index

Financial failure prediction models have been developed by using Logistic Regression (LR) analysis from traditional statistical methods and Data Envelopment Analysis (DEA), which is a mathematically based nonparametric method over the financial reports of the companies traded in The Istanbul Stock Exchange National 100 Index (BIST 100) between the years 2014-2016. In the development of these mo...

متن کامل

MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...

متن کامل

Spectral Learning of Hidden Markov Models with Group Persistence

In this paper, we develop a general Method of Moments (MoM) based parameter estimation framework for Switching Hidden Markov Model (SHMM) variants. The main obstacle for deriving a straightforward MoM algorithm for these models is the inherent permutation ambiguity in the parameter estimation, which causes the parameters of individual HMM groups to get mixed. We show that, as long as a global t...

متن کامل

Revenue - Profit Measurement in Data Envelopment Analysis with Dynamic Network Structures: A Relational Model

The correlated models are introduced in this article regarding revenue efficiency and profit efficiency in dynamic network production systems. The proposed models are not only applicable in measuring efficiency of divisional, periodical and overall efficiencies, but recognizing the exact sources of inefficiency with respect to revenue and profit efficiencies. Two numerical examples, consisting ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005